An Efficient Mechanism for Matching Multiple Patterns with Streamed Xml Data

Filtering XML data streams using efficient pattern matching algorithms is a fundamental ability for many datacentric applications and main purpose of the Template Matching sPecification Language (TMPL). In this paper extensions to the language are discussed that enable fomulating more powerful query patterns: The declarative type system, improved predicates, template references and sequence matching operators. An optimised matching runtime based on lazy constructed automata is introduced together with an explanation of the underlying formalism. An Example, case studies and performance measurements illustrate the usage and usability of TMPL.